منابع مشابه
Interval sequences and the combinatorial encoding of planar families of pairwise disjoint convex sets
We extend a combinatorial encoding of families of pairwise disjoint convex sets in the plane recently introduced by J. E. Goodman and R. Pollack to the case of families not in general position. This encoding generalizes allowable sequences, which encode finite planar point sets. Further we prove several results on realizability questions, and discuss a number of different combinatorial properti...
متن کاملAlmost disjoint families on large underlying sets
We show that, for any poset P, the existence of a P-indestructible mad family F ⊆ [ω]א0 is equivalent to the existence of such a family over אn for some/all n ∈ ω. Under the very weak square principle ¤∗∗∗ ω1,μ of Fuchino and Soukup [7] and cf([μ]א0 ,⊆) = μ+ for all limit cardinals μ of cofinality ω, the equivalence for any proper poset P transfers to all cardinals. That is, under these assumpt...
متن کاملAlmost disjoint families of connected sets
We investigate the question which (separable metrizable) spaces have a ‘large’ almost disjoint family of connected (and locally connected) sets. Every compact space of dimension at least 2 as well as all compact spaces containing an ‘uncountable star’ have such a family. Our results show that the situation for 1-dimensional compacta is unclear. 2004 Elsevier B.V. All rights reserved.
متن کاملA Model with No Strongly Separable Almost Disjoint Families
We answer a question of Shelah and Steprāns [6] by producing a model of ZFC where there are no strongly separable almost disjoint families. The notion of a strongly separable almost disjoint family is a natural variation on the well known notion of a completely separable almost disjoint family, and is closely related to the metrization problem for countable Fréchet groups.
متن کاملConstructing Pairwise Disjoint Paths with
Let P be a simple polygon and let f(ui; u 0 i)g be m pairs of distinct vertices of P where for every distinct i; j m, there exist pairwise disjoint paths connecting ui to u 0 i and uj to u 0 j. We wish to construct m pairwise disjoint paths in the interior of P connecting ui to u 0 i for i = 1; : : : ; m, with minimal total number of line segments. We give an approximation algorithm which in O(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the London Mathematical Society
سال: 2017
ISSN: 0024-6107
DOI: 10.1112/jlms.12041